Papers with learning word embeddings
Multi-Relational Hyperbolic Word Embeddings from Natural Language Definitions (2024.eacl-long)
Copied to clipboard
| Challenge: | a fundamental characteristic of natural language definitions is that they are widely abundant, pos-1. |
| Approach: | They propose a multi-relational model that explicitly leverages definitions' semantic structure to derive word embeddings. |
| Outcome: | The proposed model can preserve the semantic mapping required for interpretable traversal while imposing constraints on definitions while maintaining the recursive semantic structure. |
Towards Incremental Learning of Word Embeddings Using Context Informativeness (P19-2)
Copied to clipboard
| Challenge: | In this paper, we investigate the task of learning word embeddings from very sparse data in an incremental, cognitively-plausible way. |
| Approach: | They propose a model that incorporates informativeness into a proposed model of nonce learning, using it for context selection and learning rate modulation. |
| Outcome: | The proposed model is based on a proposed model of nonce learning, and it performs well on the task of learning new words from definitions and potentially uninformative contexts. |
Quantifying Context Overlap for Training Word Embeddings (D18-1)
Copied to clipboard
| Challenge: | Experimental results show that word embeddings can be improved using word embeds . word embedings are a popular form of natural language processing . |
| Approach: | They propose to estimate second order co-occurrence relations based on context overlap . they use the augmented data to enhance word embeddings learning . |
| Outcome: | The proposed model improves word vectors for word similarity and downstream NLP tasks. |
Incorporating Syntactic and Semantic Information in Word Embeddings using Graph Convolutional Networks (P19-1)
Copied to clipboard
Shikhar Vashishth, Manik Bhandari, Prateek Yadav, Piyush Rai, Chiranjib Bhattacharyya, Partha Talukdar
| Challenge: | Existing word embedding methods utilize sequential context of a word to learn its embeddment, but such methods result in an explosion of the vocabulary size. |
| Approach: | They propose a flexible Graph Convolution based method for learning word embeddings that utilizes the dependency context of a word without increasing the vocabulary size. |
| Outcome: | The proposed model outperforms existing methods on intrinsic and extrinsic tasks and provides an advantage when used with ELMo. |